Incremental list coloring of graphs, parameterized by conservation
نویسندگان
چکیده
منابع مشابه
Incremental List Coloring of Graphs, Parameterized by Conservation
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that each vertex has one of the colors specified by its associated list containing some of in total k colors. We introduce the “conservative version” of this problem by adding a further parameter c ∈ specifying the maxi...
متن کاملList-coloring embedded graphs
For any fixed surface Σ of genus g, we give an algorithm to decide whether a graph G of girth at least five embedded in Σ is colorable from an assignment of lists of size three in time O(|V (G)|). Furthermore, we can allow a subgraph (of any size) with at most s components to be precolored, at the expense of increasing the time complexity of the algorithm to
متن کاملEquitable List Coloring of Graphs
A graph G is equitably k-choosable if, for any k-uniform list assignment L, G admits a proper coloring π such that π(v) ∈ L(v) for all v ∈ V (G) and each color appears on at most |G|/k vertices. It was conjectured in [8] that every graph G with maximum degree ∆ is equitably k-choosable whenever k ≥ ∆ + 1. We prove the conjecture for the following cases: (i) ∆ ≤ 3; (ii) k ≥ (∆ − 1). Moreover, eq...
متن کاملSum List Coloring Block Graphs
A graph is f -choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. We characterize f -choosable functions for block graphs (graphs in which each block is a clique, including trees and line graphs of trees). The sum choice number is the minimum over all choosable functions f of the sum of the sizes in f . The sum choice...
متن کاملConditional coloring of some parameterized graphs
For integers k > 0 and r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex v of degree d(v) in G is adjacent to vertices with at least min{r, d(v)} different colors. The smallest integer k for which a graph G has a conditional (k, r)-coloring is called the rth order conditional chromatic number, denoted by χr(G). For different val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.12.049